Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
251	B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem Add to Reading List Source URL: www.caam.rice.edu Language: English - Date: 2006-08-14 16:34:49 Graph theory NP-complete problems Clique Degeneracy Dominating set Independent set Graph Degree Graph coloring Extremal graph theory
252	JMLR: Workshop and Conference Proceedings vol 40:1–13, 2015 Online Learning with Feedback Graphs: Beyond Bandits Noga Alon NOGAA @ POST. TAU . AC . IL Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 Graph theory Mathematics NP-complete problems Graph Dominating set Graph coloring Ear decomposition Directed graph Matching Line graph
253	Journal of Economic Theory 86, 159Article ID jeth, available online at http:www.idealibrary.com on Adaptive Dynamics and the Implementation Problem with Complete Information* Antonio Cabrales Add to Reading List Source URL: www.homepages.ucl.ac.uk Language: English - Date: 2015-05-12 10:02:47
254	Sheep: A Scalable Distributed Graph Partitioner Daniel Margo Margo Seltzer Algorithm Problem Add to Reading List Source URL: acmsocc.github.io Language: English - Date: 2016-02-21 03:10:50 Graph theory NP-complete problems Bipartite graphs Graph Tree Graph coloring Pathwidth Modular decomposition
255	GraphLab: A New Framework For Parallel Machine Learning Yucheng Low Carnegie Mellon University Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2010-06-15 17:18:40 Graph theory Concurrent computing Mathematics Parallel computing Distributed computing architecture NP-complete problems Graph connectivity MapReduce Speedup Graph coloring Spanning tree Graph partition
256	The complete generating function for Gessel walks is algebraic Alin Bostan (Algorithms Project, INRIA) joint work with Add to Reading List Source URL: caramba.loria.fr Language: English - Date: 2016-06-13 15:37:32 Mathematics Mathematical analysis Algebra Ordinary differential equations Orthogonal polynomials Method of undetermined coefficients Exponentials Lie groups Matrix theory Matrix exponential Laguerre polynomials
257	arXiv:1106.2436v3 [cs.LG] 25 OctFrom Bandits to Experts: On the Value of Side-Observations Ohad Shamir Microsoft Research New England Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-26 04:59:45 Graph theory NP-complete problems Independent set Matching Clique Ear decomposition Graph coloring Trapezoid graph
258	MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com A Complete and Effective Move Set for Simplified Protein Folding Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2003-02-21 13:49:05 Graph theory Mathematics Graph connectivity Algorithm Mathematical logic Theoretical computer science Path Local search Ear decomposition Eulerian path
259	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2008-02-01 14:51:28 Computational complexity theory Theory of computation Complexity classes NP-complete problems Mathematical optimization NP-hard problems MAX-3SAT NP Approximation algorithm Probabilistically checkable proof PCP theorem APX
260	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-10-22 08:43:20 Graph theory Mathematics NP-complete problems NP-hard problems Operations research Travelling salesman problem Matching Eulerian path Hamiltonian path Minimum spanning tree Cycle Line graph

UPDATE